#pragma comment(linker, "/STACK:10000000")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <cstdio>
#include <cassert>
#include <string>
#include <cstring>
#define ldb long double
#define LL long long
#define fi first
#define se second
#define fill(a, c) memset(a, c, sizeof(a))
#define sqr(a) ((a) * (a))
#define nextLine() {int c = 0; while((c = getchar()) != 10 && c != EOF);}
#define getBit(mask, k) (((mask) / pw[k]) % pw[1])
#define setBit(mask, k, l) (((mask) / pw[k + 1] * pw[1] + (l)) * pw[k] + ((mask) % pw[k]))
#define debug(a) cerr << #a << " = " << a << " ";
#define debugl(a) cerr << #a << " = " << a << "\n";
const ldb LDINF = 9128739847123.00;
const ldb eps = 1e-9;
const int INF = 1 << 30;
const ldb pi = fabsl(atan2(0.0, -1.0));
using namespace std;

int n, k, l;
int dp[20][10010];
int dp2[10010];


void Load()
{
	cin >> n >> k >> l;
	for (i = 0; i < k; i++)
	{
		cin >> x[i];
	}
	for (i = 0; i < l; i++)
	{
		cin >> a[i];
	}
}

int can(int m)
{
	if (dp2[m] != -1) return dp2[m];
	int i;
	dp2[m] = INF;
	for (i = 0; i < l; i++)
	{
		if (a[i] <= m)
		{
			dp2[m] = min(dp2[m], can(m - a[i]) + 1);
		}
		else if (a[i] > m)
		{
			dp2[m] = min(dp2[m], can(a[i] - m) + 1);
		}
	}
}

void Solve()
{
	memset(dp2, -1, sizeof(dp2));
	memset(dp, -1, sizeof(dp));

}

#define file "d"
int main()
{
	#ifndef ONLINE_JUDGE
		freopen(file".in", "rt", stdin);
		freopen(file".out", "wt", stdout);
	#endif
	Load();
	Solve();
	return 0;
}
